Jump to content

Talk:Rooted graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

rooted digraph: most common def?

[edit]

I'm trying to decide, for the sake of presentation order, what is the most common def, i.e. if they're assumed connected from root (via directed path) or not. I think in compsci the latter is the case, but I recently found a couple of papers, mostly in the greedoid/matroid/antimatroid areas that don't define them as 1-connected (to the root.) Besides the one I've already added doi:10.1090/S0002-9939-1989-0967486-0 also does this. But it's by no means the rule in this field doi:10.1016/S0166-218X(02)00471-7 defines them as connected. JMP EAX (talk) 16:46, 25 July 2014 (UTC)[reply]